Search results for "Constraint logic programming"
showing 3 items of 3 documents
Decision Support Systems Based on CLP Approach in SMEs
2006
The paper focuses on a selected class of decision problems related with the production flow planning in SMEs, particularly in new production orders. Verification of orders gives a possibility to evaluate whether resources capacity of a manufacturer is balanced with the orderer's requirements. The class of decision problems under analysis is included in the scope of organizational production preparation and can be naturally determined by available CLP (Constraint Logic Programming) tools. The approach proposed in the paper is based on establishment of an interface which facilitates its task oriented use. The system has been presented on the basis of a sample order execution in a manufacturer…
Adding Partial Functions to Constraint Logic Programming with Sets
2015
AbstractPartial functions are common abstractions in formal specification notations such as Z, B and Alloy. Conversely, executable programming languages usually provide little or no support for them. In this paper we propose to add partial functions as a primitive feature to a Constraint Logic Programming (CLP) language, namely {log}. Although partial functions could be programmed on top of {log}, providing them as first-class citizens adds valuable flexibility and generality to the form of set-theoretic formulas that the language can safely deal with. In particular, the paper shows how the {log} constraint solver is naturally extended in order to accommodate for the new primitive constrain…
Optimality conditions for nondifferentiable convex semi-infinite programming
1983
This paper gives characterizations of optimal solutions to the nondifferentiable convex semi-infinite programming problem, which involve the notion of Lagrangian saddlepoint. With the aim of giving the necessary conditions for optimality, local and global constraint qualifications are established. These constraint qualifications are based on the property of Farkas-Minkowski, which plays an important role in relation to certain systems obtained by linearizing the feasible set. It is proved that Slater's qualification implies those qualifications.